Comparison of multiagent inference methods in multiply sectioned Bayesian networks

نویسنده

  • Yang Xiang
چکیده

As intelligent systems are being applied to larger, open and more complex problem domains, many applications are found to be more suitably addressed by multiagent systems. Multiply sectioned Bayesian networks provide one framework for agents to estimate what is the true state of a domain so that the agents can act accordingly. Existing methods for multiagent inference in multiply sectioned Bayesian networks are based on linked junction forests. The methods are extensions of message passing in junction trees for inference in single-agent Bayesian networks. Many methods other than message passing in junction trees have been proposed for inference in single-agent Bayesian networks. It is unclear whether these methods can also be extended for multiagent inference. This paper presents the first investigation on this issue. In particular, we consider extending loop cutset conditioning, forward sampling and Markov sampling to multiagent inference. They are compared with the linked junction forest method in terms of off-line compilation, inter-agent messages during communication, consistent local inference, and preservation of agent privacy. The results reveal issues to be considered in investigating other single-agent oriented inference methods. The analysis provides those who implement multiagent probabilistic inference systems with a guide on the pros and cons of alternative methods. 2003 Elsevier Inc. All rights reserved. www.elsevier.com/locate/ijar International Journal of Approximate Reasoning 33 (2003) 235–254 * Tel.: +1-519-824-4120x52824; fax: +1-519-837-0323. E-mail address: [email protected] (Y. Xiang). 0888-613X/03/$ see front matter 2003 Elsevier Inc. All rights reserved. doi:10.1016/S0888-613X(03)00017-3

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Inference in Multiply Sectioned Bayesian Networks with Lazy Propagation and Linked Junction Forests

Lazy propagation reduces the space complexity. MSBNs extend BNs to multiagent. To combine the benefits of the two, a framework was proposed earlier to apply lazy propagation to inference in MSBNs. We propose an alternative framework with a simpler compiled structure.

متن کامل

Inference in Multiply Sectioned Bayesian

As Bayesian networks are applied to larger and more complex problem domains, search for exible modeling and more eecient inference methods is an ongoing eeort. Multiply sectioned Bayesian networks (MSBNs) extend the HUGIN inference for Bayesian networks into a coherent framework for exible modeling and distributed inference. Lazy propagation extends the Shafer-Shenoy and HUGIN inference methods...

متن کامل

Comparing Alternative Methods for Inference in Multiply Sectioned Bayesian Networks

Multiply sectioned Bayesian networks (MSBNs) provide one framework for agents to estimate the state of a domain. Existing methods for multi-agent inference in MSBNs are based on linked junction forests (LJFs). The methods are extensions of message passing in junction trees for inference in singleagent Bayesian networks (BNs). We consider extending other inference methods in single-agent BNs to ...

متن کامل

Distributed Equipment Monitoring and Diagnosis with Multiply Sectioned Bayesian Networks

Multiply sectioned Bayesian networks (MSBNs) are extension of Bayesian networks for flexible modeling and cooperative multiagent probabilistic inference. A large and complex equipment is modeled by a set of Bayesian subnets in a MSBN each of which corresponds to a natural component of the equipment. Each subnet forms the core knowledge of an autonomous M&D agent. Inference is performed in a dis...

متن کامل

Local Importance Sampling in Multiply Sectioned Bayesian Networks

The multiply sectioned Bayesian network (MSBN) is a well-studied model for probability reasoning in a multiagent setting. Exact inference, however, becomes difficult as the problem domain grows larger and more complex. We address this issue by integrating approximation techniques with the MSBN Linked Junction Tree Forest (LJF) framework. In particular, we investigate the application of importan...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Int. J. Approx. Reasoning

دوره 33  شماره 

صفحات  -

تاریخ انتشار 2003